// Copyright (C) Kumo inc. and its affiliates.
// Author: Jeff.li lijippy@163.com
// All rights reserved.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published
// by the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.
//


#include <melon/benchmark.h>
#include <melon/init/init.h>

#include "melon/init/Init.h"
#include <pollux/dwio/common/chained_buffer.h>

using namespace kumo::pollux::dwio;
using namespace kumo::pollux::dwio::common;

BENCHMARK(DataBufferOps, iters) {
  auto pool = kumo::pollux::memory::memoryManager()->addLeafPool();
  constexpr size_t size = 1024 * 1024 * 16;
  for (size_t i = 0; i < iters; ++i) {
    DataBuffer<int32_t> buf{*pool};
    buf.reserve(size);
    for (size_t j = 0; j < size; ++j) {
      buf.unsafeAppend(j);
    }
    for (size_t j = 0; j < size; ++j) {
      melon::doNotOptimizeAway(buf[j]);
    }
  }
}

BENCHMARK(ChainedBufferOps, iters) {
  auto pool = kumo::pollux::memory::memoryManager()->addLeafPool();
  constexpr size_t size = 1024 * 1024 * 16;
  for (size_t i = 0; i < iters; ++i) {
    ChainedBuffer<int32_t> buf{*pool, size, size * 4};
    for (size_t j = 0; j < size; ++j) {
      buf.unsafeAppend(j);
    }
    for (size_t j = 0; j < size; ++j) {
      melon::doNotOptimizeAway(buf[j]);
    }
  }
}

int main(int argc, char* argv[]) {
  melon::Init init{&argc, &argv};
  melon::runBenchmarks();
  kumo::pollux::memory::MemoryManager::initialize({});
  return 0;
}
